Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models
نویسندگان
چکیده
منابع مشابه
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theoretical and experimental results for CSP. In the theoretical part we present the hull approach, a combinatorial algorithm for solving a linear programming relaxation and prove that it runs in polynomial time in the case...
متن کاملAlgorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths
Resource constrained shortest path problems are usually solved by label algorithms, which consist in a smart enumeration of the non-dominated paths. Recent improvements of these algorithms rely on the use of bounds on path resources to discard partial solutions. The quality of the bounds determines the performance of the algorithm. The main contribution of this paper is to introduce a standard ...
متن کاملApproximation algorithms for shortest descending paths in terrains
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give two approximation algorithms (more precisely, FPTASs) that solve the SDP problem on general terrains. Both algorithms are simple, robus...
متن کاملOn Degree Constrained Shortest Paths
Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, “actual” edges and “potential” edges. In addition, each vertex has a degree/interface constraint. We wish to compute a shortest path in the graph that m...
متن کاملShortest Paths Algorithms : Theory And
We conduct an extensive computational study of shortest paths algorithms , including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2014
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-014-0624-5